منابع مشابه
Klee sets and Chebyshev centers for the right Bregman distance
We systematically investigate the farthest distance function, farthest points, Klee sets, and Chebyshev centers, with respect to Bregman distances induced by Legendre functions. These objects are of considerable interest in Information Geometry and Machine Learning; when the Legendre function is specialized to the energy, one obtains classical notions from Approximation Theory and Convex Analys...
متن کاملAlgebraic solutions to multidimensional minimax location problems with Chebyshev distance
Multidimensional minimax single facility location problems with Chebyshev distance are examined within the framework of idempotent algebra. A new algebraic solution based on an extremal property of the eigenvalues of irreducible matrices is given. The solution reduces both unconstrained and constrained location problems to evaluation of the eigenvalue and eigenvectors of an appropriate matrix. ...
متن کاملApproximating weak Chebyshev subspaces by Chebyshev subspaces
We examine to what extent finite-dimensional spaces defined on locally compact subsets of the line and possessing various weak Chebyshev properties (involving sign changes, zeros, alternation of best approximations, and peak points) can be uniformly approximated by a sequence of spaces having related properties. r 2003 Elsevier Science (USA). All rights reserved.
متن کاملBregman distance, approximate compactness and convexity of Chebyshev sets in Banach spaces
We present some sufficient conditions ensuring the upper semicontinuity and the continuity of the Bregman projection operator ΠgC and the relative projection operator P g C in terms of the D-approximate (weak) compactness for a nonempty closed set C in a Banach space X. We next present certain sufficient conditions as well as equivalent conditions for the convexity of a Chebyshev subset of a Ba...
متن کاملWeighted Chebyshev Distance Algorithms for Hyperspectral Target Detection and Classification Applications
Abstract. In this study, an efficient spectral similarity method referred to as Weighted Chebyshev Distance (WCD) method is introduced for supervised classification of hyperspectral imagery (HSI) and target detection applications. The WCD is based on a simple spectral similarity based decision rule using limited amount of reference data. The estimation of upper and lower spectral boundaries of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Formalized Mathematics
سال: 2016
ISSN: 1898-9934,1426-2630
DOI: 10.1515/forma-2016-0010